The Thrackle Conjecture for K5 and K3,3
نویسندگان
چکیده
We prove the thrackle conjecture for K5 and K3,3. To do this we reduce the problem to a set of simultaneous quadratic equations over Z2. Parts of this proof are computer assisted.
منابع مشابه
Independent paths and K5-subdivisions
A well known theorem of Kuratowski states that a graph is planar iff it contains no subdivision of K5 or K3,3. Seymour conjectured in 1977 that every 5-connected nonplanar graph contains a subdivision of K5. In this paper, we prove several results about independent paths (no vertex of a path is internal to another), which are then used to prove Seymour’s conjecture for two classes of graphs. Th...
متن کاملEmbedding Graphs Containing K5-Subdivisions
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partition of the vertices of G\K5 into equivalence classes. As a result, we can reduce a projective planarity or toroidality algorithm to a small constant number of simple planarity checks [6] or to a K3,3-subdivision in the...
متن کاملReachability in K3,3-free and K5-free Graphs is in Unambiguous Logspace
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL∩ coUL. This significantly extends the result of Bourke, Tewari, and Vinodchandran that the reachability problem for directed planar graphs is in UL∩ coUL. Our algorithm decomposes the graphs into biconnected and triconnected components. This gives a tree structure on th...
متن کاملNowhere zero 4-flow in regular matroids
Jensen and Toft [10] conjectured that every 2-edge-connected graph without a K5minor has a nowhere zero 4-flow. Walton and Welsh [24] proved that if a coloopless regular matroid M does not have a minor in {M(K3,3),M(K5)}, then M admits a nowhere zero 4-flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K5),M(K5)}, then M admits a nowhere zero 4-flow....
متن کاملA Study of Conway's Thrackle Conjecture
A thrackle is a drawing of a simple graph on the plane, where each edge is drawn as a smooth arc with distinct end-points, and every two arcs have exactly one common point, at which they have distinct tangents. Conway, who coined the term thrackle, conjectured that there is no thrackle with more edges than vertices – a question which is still unsolved. A full thrackle is one with n vertices and...
متن کامل